An Efficient Algorithm for Computing Zero-Order Hankel Transforms
نویسندگان
چکیده
Postnicov [22], in 2003, proposed an algorithm to compute the Hankel transforms of order zero and one by using Haar wavelets. But the proposed method faced problems in the evaluation of zero order Hankel transform. The purpose of this paper is to overcome this problem and obtain an efficient algorithm for evaluating Hankel transform of order zero by using rationalized Haar wavelets. Exact analytical representation of the Hankel transform, as series of the Bessel functions multiplied by the wavelet coefficients of the input function, is obtained. Numerical examples are given to illustrate the proposed algorithm. Mathematics Subject Classification: 44A15; 65R10
منابع مشابه
Calculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms
The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...
متن کاملComputation of quasi-discrete Hankel transforms of integer order for propagating optical wave fields.
The method originally proposed by Yu et al. [Opt. Lett. 23, 409 (1998)] for evaluating the zero-order Hankel transform is generalized to high-order Hankel transforms. Since the method preserves the discrete form of the Parseval theorem, it is particularly suitable for field propagation. A general algorithm for propagating an input field through axially symmetric systems using the generalized me...
متن کاملEecient Two-parameter Hankel Transforms in Adaptive Optics System Evaluations
We derive e cient approaches for two-parameter Hankel transforms. Such transforms arise, for example, in covariance matrix computations for performance modeling and evaluation of adaptive optics (AO) systems. Fast transforms are highly desirable since the parameter space for performance evaluation and optimization is large. They may be also applicable in real-time control algorithms for future ...
متن کاملNumerical integration of related Hankel tiansforms by quadrature and continued fraction expansion
An algorithm is presented for the accurate evaluation of Hankel (or Bessel) transforms of algebraically related kernel functions, defined here as the non-Bessel function portion of the integrand, that is more widely applicable than the standard digital filter methods without enormous increases in computational burden. The algorithm performs the automatic integration of the product of the kernel...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کامل